A Björck-Pereyra-type algorithm for Szegö-Vandermonde matrices based on properties of unitary Hessenberg matrices1
نویسندگان
چکیده
In this paper we carry over the Björck-Pereyra algorithm for solving Vandermonde linear systems to what we suggest to call Szegö-Vandermonde systems VΦ(x), i.e., polynomialVandermonde systems where the corresponding polynomial system Φ is the Szegö polynomials. The properties of the corresponding unitary Hessenberg matrix allow us to derive a fast O(n2) computational procedure. We present numerical experiments that indicate that for ill-conditioned matrices the new algorithm yields better forward accuracy than Gaussian elimination. Preprint submitted to Linear Algebra and its Applications
منابع مشابه
A fast Björck-Pereyra-like algorithm for solving quasiseparable- Hessenberg-Vandermonde systems
In this paper we derive a fast O(n) algorithm for solving linear systems where the coefficient matrix is a polynomial-Vandermonde VR(x) = [rj−1(xi)] matrix with polynomials R related to a quasiseparable matrix. The result is a generalization of the well-known Björck-Pereyra algorithm for classical Vandermonde systems. As will be shown, many important systems of polynomials are related to quasis...
متن کاملA Fast Björck-Pereyra-Type Algorithm for Solving Hessenberg-Quasiseparable-Vandermonde Systems
In this paper we derive a fast O(n) algorithm for solving linear systems where the coefficient matrix is a polynomial-Vandermonde matrix VR(x) = [rj−1(xi)] with polynomials {rk(x)} related to a Hessenberg quasiseparable matrix. The result generalizes the well-known Björck-Pereyra algorithm for classical Vandermonde systems involving monomials. It also generalizes the algorithms of [RO91] for VR...
متن کاملNew Bases for Polynomial-Based Spaces
Since it is well-known that the Vandermonde matrix is ill-conditioned, while the interpolation itself is not unstable in function space, this paper surveys the choices of other new bases. These bases are data-dependent and are categorized into discretely l2-orthonormal and continuously L2-orthonormal bases. The first one construct a unitary Gramian matrix in the space l2(X) while the late...
متن کاملA Fast Bjorck-Pereyra-type Algorithm for Solving Cauchy Linear Equations
In this paper we propose a new fast O(n) algorithm for solving Cauchy linear systems of equations. An a priori rounding error analysis, which provides bounds for the forward, backward and residual errors associated with the computed solution, indicates that for the class of totally positive Cauchy matrices the proposed algorithm is forward and backward stable, producing a remarkably high relati...
متن کاملA Traub–like algorithm for Hessenberg-quasiseparable-Vander- monde matrices of arbitrary order
Although Gaussian elimination uses O(n) operations to invert an arbitrary matrix, matrices with a special Vandermonde structure can be inverted in only O(n) operations by the fast Traub algorithm. The original version of Traub algorithm was numerically unstable although only a minor modification of it yields a high accuracy in practice. The Traub algorithm has been extended from Vandermonde mat...
متن کامل